A Uni ed Approach to Multilayer Over-the-Cell Routing
نویسندگان
چکیده
Several Over-the-Cell (OTC) routing algorithms have been proposed for two and three layer processes. All the existing OTC routers can be used only on the cell models for which they were developed for. In this paper, we develop a uni ed approach to multi-layer routing, motivated by over-the-cell routing, which can be used for full-custom layouts. Our approach can also be directly applied to standard cell layouts, irrespective of the cell model used in the design. Our router has been implemented in C and tested on industrial benchmarks, such as PRIMARY I and PRIMARY II, for which it obtained channel-less layouts.
منابع مشابه
Leach Routing Algorithm Optimization through Imperialist Approach
Routing is an important challenge in WSN due to the presence of hundreds or thousands of sensor nodes. Low Energy Adaptive Clustering Hierarchy (LEACH) is a hierarchical routing and data dissemination protocol. LEACH divides a network domain into several sub-domains that are called clusters. Non-uniformity of cluster distribution and CHs selection without considering the positions of other sens...
متن کاملBroadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach
While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...
متن کاملa swift heuristic algorithm base on data mining approach for the Periodic Vehicle Routing Problem: data mining approach
periodic vehicle routing problem focuses on establishing a plan of visits to clients over a given time horizon so as to satisfy some service level while optimizing the routes used in each time period. This paper presents a new effective heuristic algorithm based on data mining tools for periodic vehicle routing problem (PVRP). The related results of proposed algorithm are compared with the resu...
متن کاملAcceleration of Lagrangian Method for the Vehicle Routing Problem with Time Windows
The analytic center cutting plane method (ACCPM) is one of successful methods to solve nondifferentiable optimization problems. In this paper ACCPM is used for the first time in the vehicle routing problem with time windows (VRPTW) to accelerate lagrangian relaxation procedure for the problem. At first the basic cutting plane algorithm and its relationship with column generation method is clari...
متن کاملA Robust Model for a Dynamic Cellular Manufacturing System with Production Planning
In this paper, a robust optimization approach is proposed to design a dynamic cellular manufacturing system (DCMS) under uncertainty of processing time of products. In addition, a mathematical model considering cell formation, inter-cell design and production planning under a dynamic environment (i.e., product mix and demand are changed in each period) is presented. Therefore, reconfiguration b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995